Approximation algorithms for grooming in optical network design

Design Algorithms for Doppler MTI and Filters (Using Chebyshev Approximation)

Design Algorithms for Doppler MTI and Filters (Using Chebyshev Approximation)

Approximation Algorithms for Network Design: A Survey

In a typical instance of a network design problem, we are given a directed or undirected graph G = (V,E), non-negative edge-costs ce for all e∈E, and our goal is to find a minimum-cost subgraph H of G that satisfies some design criteria. For example, we may wish to find a minimum-cost set of edges that induces a connected graph (this is the minimum-cost spanning tree problem), or we might want ...

Approximation Algorithms for NETWORK DESIGN AND ORIENTEERING

This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic assumption that P 6 = NP, there are no efficient (i.e., polynomial-time) algorithms that solve these problems exactly. Hence, if one desires efficient algorithms for s...

Approximation Algorithms to the Network Design Problems

Preface In spite of the outstanding progress in combinatorial optimization, most problems classified as NP-hard were left untouched for a long time. However, some challenges have appeared for dealing with such problems recently. One of them is the framework of approximation algorithms. An approximation algorithm usually guarantees that the cost of the computed solution is bounded by some factor...